Proximity Drawings of High-Degree Trees
نویسندگان
چکیده
A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree? We approach this question by supposing that a partition or covering of the tree by subtrees of bounded degree is given. Then we show that if the partition or covering satisfies some natural properties, then there is a drawing of the entire tree such that each of the given subtrees is drawn as a minimum spanning tree of its vertex
منابع مشابه
Proximity drawings in polynomial area and volume
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially with the size of the graph. This holds even when we restrict ourselves to binary trees. Our method is quite general and yields the first algorithms to construct (a) polynomial area weak Gabriel drawings of ternary trees...
متن کاملProximity Drawings: Three Dimensions Are Better than Two
We consider weak Gabriel drawings of unbounded degree trees in the three-dimensional space. We assume a minimum distance between any two vertices. Under the same assumption, there exists an exponential area lower bound for general graphs. Moreover, all previously known algorithms to construct (weak) proximity drawings of trees, generally produce exponential area layouts, even when we restrict o...
متن کاملProximity drawings of binary trees in polynomial area
In this paper we study weak proximity drawings All known algorithms that compute weak proximity drawings produce representations whose area increases exponentially with the number of vertices Additionally an exponential lower bound on the area of weak proximity drawings of general graph has been proved We present the rst algorithms that compute a polynomial area proximity drawing of binary and ...
متن کاملProximity Constraints and Representable Trees
This paper examines an infinite family of proximity drawings of graphs called open and closed ß-drawings, first defined by Kirkpatrick and Radke [15, 21] in the context of computational morphology. Such proximity drawings include as special cases the well-known Gabriel, relative neighborhood and strip drawings. Complete characterizations of those trees that admit open /^-drawings for 0 < ß < iz...
متن کاملComputing β-Drawings of 2-Outerplane Graphs
A proximity drawing of a plane graph G is a straight-line drawing of G with the additional geometric constraint that two vertices of G are adjacent if and only if the well-defined “proximity region” of these two vertices does not contain any other vertex. In one class of proximity drawings, known as β-drawings, the proximity region is parameterized by β, where β ∈ [0,∞]. Given a plane graph G, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 23 شماره
صفحات -
تاریخ انتشار 2013